Polynomial kernels for Proper Interval Completion and related problems
نویسندگان
چکیده
منابع مشابه
Polynomial Kernels for Proper Interval Completion and Related Problems
Given a graph G = (V,E) and a positive integer k, the Proper Interval Completion problem asks whether there exists a set F of at most k pairs of (V ×V ) \E such that the graph H = (V,E ∪F ) is a proper interval graph. The Proper Interval Completion problem finds applications in molecular biology and genomic research [16, 24]. First announced by Kaplan, Tarjan and Shamir in FOCS ’94, this proble...
متن کاملPolynomial Kernels for Weighted Problems
Kernelization is a formalization of efficient preprocessing for NP-hard problems using the framework of parameterized complexity. Among open problems in kernelization it has been asked many times whether there are deterministic polynomial kernelizations for Subset Sum and Knapsack when parameterized by the number n of items. We answer both questions affirmatively by using an algorithm for compr...
متن کاملOn problems without polynomial kernels
Kernelization is a central technique used in parameterized algorithms, and in other techniques for coping with NP-hard problems. In this paper, we introduce a new method which allows us to show that many problems do not have polynomial size kernels under reasonable complexity-theoretic assumptions. These problems include kPath, k-Cycle, k-Exact Cycle, k-Short Cheap Tour, k-Graph Minor Order Tes...
متن کاملA Subexponential Parameterized Algorithm for Proper Interval Completion
In the Proper Interval Completion problem we are given a graph G and an integer k, and the task is to turn G using at most k edge additions into a proper interval graph, i.e., a graph admitting an intersection model of equal-length intervals on a line. The study of Proper Interval Completion from the viewpoint of parameterized complexity has been initiated by Kaplan, Shamir and Tarjan [FOCS 199...
متن کاملPathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
We study two related problems motivated by molecular biology: Given a graph G and a constant k, does there exist a supergraph G 0 of G which is a unit interval graph and has clique size at most k? Given a graph G and a proper k-coloring c of G, does there exist a supergraph G 0 of G which is properly colored by c and is a unit interval graph? We show that those problems are polynomial for xed k...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2013
ISSN: 0890-5401
DOI: 10.1016/j.ic.2013.08.006